منابع مشابه
Separating OR, SUM, and XOR Circuits
Given a boolean n × n matrix A we consider arithmetic circuits for computing the transformation x ↦ Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative integers), and non-monotone XOR-circuits (addition modulo 2). Our focus is on separating OR-circuits from the two other models in terms of circuit complexity: ...
متن کاملPower Consumption in XOR-Based Circuits
| The use of XOR gates has shown several advantages in modern circuit design, e.g. smaller representation size and better testability. In this paper we consider power consumption in XOR dominated circuits and compare such designs with traditional AND/OR logic. We investigate the suitability of using di erent delay models such as unit delay, fanout delay, and random delay in power estimation of ...
متن کاملOR-Bridging Fault Identification and Diagnosis for Exclusive-OR Sum of Products Reed-Muller Canonical Circuits
Problem statement: The faults in digital circuit can be classified broadly as single stuck-atfaults, multiple stuck-ay-faults, stuck-open faults, stuck-on faults, path delay faults, transient faults. Extensive research had been carried out in the field of testing of digital circuits to limit the number of input vectors. The cardinality of the test vectors proposed by many authors was quite high...
متن کاملSeparating Ac from Depth-2 Majority Circuits∗
We construct a function in AC that cannot be computed by a depth-2 majority circuit of size less than exp(Θ(n1/5)). This solves an open problem due to Krause and Pudlák (1997) and matches Allender’s classic result (1989) that AC can be efficiently simulated by depth-3 majority circuits. To obtain our result, we develop a novel technique for proving lower bounds on communication complexity. This...
متن کاملAOXMIN-MV: A Heuristic Algorithm for AND-OR-XOR Minimization
Three-level logic is shown to have a potential for reduction of the area over twolevel implementations, as well as for a gain in speed over multi-level implementations. In this paper we present an heuristic algorithm, AOXMIN-MV, targeting a three-level logic expression which is an XOR of two sum-of-products. For some practical functions, such an AND-OR-XOR expression may have up to 27 times les...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2016
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2016.01.001